Exact Response Time Analysis for Fixed Priority Memory-Processor Co-Scheduling
نویسندگان
چکیده
منابع مشابه
A faster exact schedulability analysis for fixed-priority scheduling
Real-time scheduling for task sets has been studied, and the corresponding schedulability analysis has been developed. Due to the considerable overheads required to precisely analyze the schedulability of a task set (referred to as exact schedulability analysis), the trade-off between precision and efficiency is widely studied. Many efficient but imprecise (i.e., sufficient but not necessary) a...
متن کاملExact best-case response time analysis of real-time tasks under fixed-priority pre-emptive scheduling for arbitrary deadlines
In this paper, we present a conjecture for exact best-case response times of periodic released, independent real-time tasks with arbitrary deadlines that are scheduled by means of fixed-priority pre-emptive scheduling (FPPS). We illustrate the analysis by means of an example. Apart from having a value on its own whenever timing constraints include lower bounds on response times of a system to e...
متن کاملExact worst-case response times of real-time tasks under fixed-priority scheduling with deferred preemption
In this paper, we present equations to determine the exact worst-case response times of periodic tasks under fixedpriority scheduling with deferred preemption (FPDS) and arbitrary phasing. We show that the worst-case response time analysis is not uniform for all tasks. Our exact analysis is based on a dedicated conjecture for an ε-critical instant, and uses the notion of worst-case occupied time.
متن کاملExact best-case response time analysis of fixed priority scheduled tasks with arbitrary response times
A solution to the exact best-case response time analysis for a set of independent periodic tasks with fixed priorities is presented here. The analysis is dual to the well-known worst-case response time analysis. The motivation for this work comes primarily from the study of jitter in real-time systems dedicated to feedback control. In the best-case response time analysis, higher priority tasks ...
متن کاملEfficient computation of response time bounds under fixed-priority scheduling
All algorithms currently known for computing the response time of tasks scheduled under fixed-priority scheduling have run-time pseudo-polynomial in the representation of the task system. We derive a formula that can be computed in polynomial time for determining an upper bound on response times; our upper bound on response time has the added benefit of being continuous in the task system param...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2017
ISSN: 0018-9340
DOI: 10.1109/tc.2016.2614819